On computations with integer division
نویسندگان
چکیده
منابع مشابه
On Computations with Integer Division
We consider computation trees (CTs) with operations $S \subset {+,-, *, DIV, DIV_c}$, where $DIV$ denotes integer division and $DIV_c$ integer division by constants. We characterize the families of languages $L \subset N$ that can be recognized over ${+,-, DIV_c}$ and ${+,-, *, DIV}$, resp. and show that they are identical. Furthermore, we prove lower bounds for CT's with operations ${+,-, DIV_...
متن کاملCapabilities and Complexity of Computations with Integer Division
Computation trees with operation set S f+;?; ;DIV; DIV c g (S-CTs) are considered. DIV denotes integer division, DIV c integer division by constants. We characterize the families of languages L Z Z n that can be recognized by S-CTs, separate the computational capabilities of S-CTs for diierent operation sets S, and prove lower bounds for the depth of such trees.
متن کاملExact computations on polynomial and integer matrices
One may consider that the algebraic complexity of basic linear algebra over an abstract field K is well known. Indeed, if ω is the exponent of matrix multiplication over K, then for instance computing the determinant, the matrix inverse, the rank or the characteristic polynomial of an n×n matrix over K can be done in O (̃n) operations in K. Here the soft “O” notation indicates some missing logar...
متن کاملFast Multi-computations with Integer Similarity Strategy
Multi-computations in finite groups, such as multiexponentiations and multi-scalar multiplications, are very important in ElGamallike public key cryptosystems. Algorithms to improve multi-computations can be classified into two main categories: precomputing methods and recoding methods. The first one uses a table to store the precomputed values, and the second one finds a better binary signed-d...
متن کاملOn Secure Two-Party Integer Division
We consider the problem of secure integer division: given two Paillier encryptions of `-bit values n and d, determine an encryption of b d c without leaking any information about n or d. We propose two new protocols solving this problem. The first requires O(`) arithmetic operation on encrypted values (secure addition and multiplication) in O(1) rounds. This is the most efficient constant-round...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: RAIRO - Theoretical Informatics and Applications
سال: 1989
ISSN: 0988-3754,1290-385X
DOI: 10.1051/ita/1989230101011